Distributed Encryption and Decryption Algorithms

نویسندگان

  • André Postma
  • Willem de Boer
  • Arne Helme
  • Gerard Smit
چکیده

In this paper, we describe distributed encryption and decryption algorithms. These algorithms are required in order to make a dependable distributed data storage system in which data is stored in an encrypted form resilient to a number of arbitrarily faulty nodes in the system. By execution of these algorithms, a group of n nodes is able to encrypt or decrypt data with any secret cryptographic function in the system in the presence of up to t arbitrarily faulty nodes, whereas the following requirements are met: ❏ loss of information of up to t nodes never leads to loss of any cryptographic key ❏ t or less nodes are unable to compute a secret cryptographic function and encrypt or decrypt data with it ❏ any group of n t or more nodes may encrypt or decrypt data with any cryptographic

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

QTRU: quaternionic version of the NTRU public-key cryptosystems

In this paper we will construct a lattice-based public-key cryptosystem using non-commutative quaternion algebra, and since its lattice does not fully fit within Circular and Convolutional Modular Lattice (CCML), we prove it is arguably more secure than the existing lattice-based cryptosystems such as NTRU. As in NTRU, the proposed public-key cryptosystem relies for its inherent securi...

متن کامل

FPGA Can be Implemented Using Advanced Encryption Standard Algorithm

This paper mainly focused on implementation of AES encryption and decryption standard AES-128. All the transformations of both Encryption and Decryption are simulated using an iterativedesign approach in order to minimize the hardware consumption. This method can make it avery low-complex architecture, especially in saving the hardware resource in implementing theAES InverseSub Bytes module and...

متن کامل

The Distributed Decryption Schemes for Somewhat Homomorphic Encryption

We propose distributed decryption schemes for somewhat homomorphic encryption (SHE). The proposed schemes are constructed based on the encryption scheme by Brakerski and Vaikuntanathan. In SHE, homomorphic multiplication increases the number of elements in a ciphertext. The proposed scheme can decrypt a ciphertext containing more than two elements with k out of N parties. The distributed decryp...

متن کامل

Voting ( Excerpts of Chapter 3 )

4 Voting with Homomorphic Encryption 3 4.1 Zero-Knowledge Proofs . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 3 4.2 Homomorphic Encryption . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 4 4.2.1 Homomorphic Encryption and Decryption . . . . . . . . . . . . . . . . . . . 4 4.2.2 Distributed Key Generation . . . . . . . . . . . . . . . . . . . . . . . . . . ...

متن کامل

Decryption of pure-position permutation algorithms.

Pure position permutation image encryption algorithms, commonly used as image encryption investigated in this work are unfortunately frail under known-text attack. In view of the weakness of pure position permutation algorithm, we put forward an effective decryption algorithm for all pure-position permutation algorithms. First, a summary of the pure position permutation image encryption algorit...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 1996